Multiagent Coordination in Tightly Coupled Task Scheduling
نویسندگان
چکیده
We consider an environment where agents' tasks are tightly coupled and require real-time scheduling and execution. In order to complete their tasks, agents need to coordinate their actions both constantly and extensively. We present an approach that consists of a standard operating procedure and a look-ahead coordination. The standard operating procedure regulates task coupling and minimizes communication. The look-ahead coordination increases agents' global visibility and provides indicative information for decision adjustment. The goal of our approach is to prune decision myopia while maintaining system responsiveness in real-time, dynamic environments. Experimental results in job shop scheduling problems show that (1) the look-ahead coordination significantly enhances the performance of the standard operating procedure in solution quality, (2) the approach is capable of producing solutions of very high quality in a real-time environment.
منابع مشابه
D++: Structural credit assignment in tightly coupled multiagent domains
Autonomous multiagent teams can be used in complex exploration tasks to both expedite the exploration and improve the efficiency. However, use of multiagent systems presents additional challenges. Specifically, in domains where the agents' actions are tightly coupled, coordinating multiple agents to achieve cooperative behavior at the group level is difficult. In this work, we demonstrate that ...
متن کاملResource Management in Complex Socio-technical Systems: a Multiagent Coordination Framework
Resource management in complex socio-technical systems is a central and crucial task. The many diverse components involved together with various constraints such as real-time conditions make it impossible to devise exact optimal solutions. In this article, we present an approach to the resource management problem based on the multiagent paradigm to be applied in the context of a shipboard comma...
متن کاملSolving the flexible job shop problem by hybrid metaheuristics-based multiagent model
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...
متن کاملTightly Coupled Cooperation among Independent Agents
Coordination is defined as ”the harmonious functioning of parts for effective results” (Mish 1996). When applied to multiple robot systems, coordination is classified by one of two categories: collaboration or cooperation. Each component contributes to the harmonious functioning aspect of Coordination. Collaboration occurs when multiple robots engage in separate independent tasks to fulfill a h...
متن کاملCoordination of Multiple Agents in Distributed Manufacturing Scheduling
Distribiit,ed Problem Solving (DPS) is concerned with a group of agents, each with only local views, that cooperate and coordinate to solve a given problem in a coherent and efficient manner. As networked computer systems and practical concurrcnt processing architectures develop, DPS research has seen increasing realization in real world problems. As opposed to using sophisticated agents in pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996